On Parameterized Independent Feedback Vertex Set
نویسندگان
چکیده
منابع مشابه
On Parameterized Independent Feedback Vertex Set
We investigate a generalization of the classical Feedback Vertex Set (FVS) problem from the point of view of parameterized algorithms. Independent Feedback Vertex Set (IFVS) is the “independent” variant of the FVS problem and is defined as follows: given a graph G and an integer k, decide whether there exists F ⊆ V (G), |F | ≤ k, such that G[V (G)\F ] is a forest and G[F ] is an independent set...
متن کاملSimultaneous Feedback Vertex Set: A Parameterized Perspective
For a family of graphs F , a graph G, and a positive integer k, the F-Deletion problem asks whether we can delete at most k vertices from G to obtain a graph in F . F-Deletion generalizes many classical graph problems such as Vertex Cover, Feedback Vertex Set, and Odd Cycle Transversal. A graph G = (V,∪i=1Ei), where the edge set of G is partitioned into α color classes, is called an α-edge-colo...
متن کاملParameterized Algorithms for Feedback Vertex Set
We present an algorithm for the parameterized feedback vertex set problem that runs in time O((2 lg k + 2 lg lg k + 18)n). This improves the previous O(max{12, (4 lg k)}n) algorithm by Raman et al. by roughly a 2 factor (n ∈ O(n) is the time needed to multiply two n × n matrices). Our results are obtained by developing new combinatorial tools and employing results from extremal graph theory. We...
متن کاملOn Directed Feedback Vertex Set parameterized by treewidth
We study the Directed Feedback Vertex Set problem parameterized by the treewidth of the input graph. We prove that unless the Exponential Time Hypothesis fails, the problem cannot be solved in time 2 log t) · n on general directed graphs, where t is the treewidth of the underlying undirected graph. This is matched by a dynamic programming algorithm with running time 2 log t) · n. On the other h...
متن کاملExperimental Evaluation of Parameterized Algorithms for Feedback Vertex Set
Feedback Vertex Set is a classic combinatorial optimization problem that asks for a minimum set of vertices in a given graph whose deletion makes the graph acyclic. From the point of view of parameterized algorithms and fixed-parameter tractability, Feedback Vertex Set is one of the landmark problems: a long line of study resulted in multiple algorithmic approaches and deep understanding of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.02.012